An Iterative Closest Points Algorithm for Registration of 3D Laser Scanner Point Clouds with Geometric Features
نویسندگان
چکیده
The Iterative Closest Points (ICP) algorithm is the mainstream algorithm used in the process of accurate registration of 3D point cloud data. The algorithm requires a proper initial value and the approximate registration of two point clouds to prevent the algorithm from falling into local extremes, but in the actual point cloud matching process, it is difficult to ensure compliance with this requirement. In this paper, we proposed the ICP algorithm based on point cloud features (GF-ICP). This method uses the geometrical features of the point cloud to be registered, such as curvature, surface normal and point cloud density, to search for the correspondence relationships between two point clouds and introduces the geometric features into the error function to realize the accurate registration of two point clouds. The experimental results showed that the algorithm can improve the convergence speed and the interval of convergence without setting a proper initial value.
منابع مشابه
Evaluation of the Convergence Region of an Automated Registration Method for 3D Laser Scanner Point Clouds
Using three dimensional point clouds from both simulated and real datasets from close and terrestrial laser scanners, the rotational and translational convergence regions of Geometric Primitive Iterative Closest Points (GP-ICP) are empirically evaluated. The results demonstrate the GP-ICP has a larger rotational convergence region than the existing methods, e.g., the Iterative Closest Point (ICP).
متن کاملDetection of some Tree Species from Terrestrial Laser Scanner Point Cloud Data Using Support-vector Machine and Nearest Neighborhood Algorithms
acquisition field reference data using conventional methods due to limited and time-consuming data from a single tree in recent years, to generate reference data for forest studies using terrestrial laser scanner data, aerial laser scanner data, radar and Optics has become commonplace, and complete, accurate 3D data from a single tree or reference trees can be recorded. The detection and identi...
متن کاملمدلسازی صفحهای محیطهای داخلی با استفاده از تصاویر RGB-D
In robotic applications and especially 3D map generation of indoor environments, analyzing RGB-D images have become a key problem. The mapping problem is one of the most important problems in creating autonomous mobile robots. Autonomous mobile robots are used in mine excavation, rescue missions in collapsed buildings and even planets’ exploration. Furthermore, indoor mapping is beneficial in f...
متن کاملIcl: Iterative Closest Line a Novel Point Cloud Registration Algorithm Based on Linear Features
The problem of matching 3D TLS point clouds is a necessary stage which precedes any kind of modeling in order to perfect the object’s geometry and to control its accuracy. It has been studied extensively in many graphical and image-processing domains, However there is a lack of an adaptive study of this problem in the domain of laser scanning for architectural and urban purposes. Hence, our stu...
متن کاملAutomated Registration of Unorganised Point Clouds from Terrestrial Laser Scanners
Terrestrial laser scanners provide a three-dimensional sampled representation of the surfaces of objects resulting in a very large number of points. The spatial resolution of the data is much higher than that of conventional surveying methods. Since laser scanners have a limited field of view, in order to obtain a complete representation of an object it is necessary to collect data from several...
متن کامل